Finite choice, convex choice and finding roots
نویسندگان
چکیده
منابع مشابه
Choice functions and abstract convex geometries *
A main aim of this paper is to make connections between two well – but up to now independently – developed theories, the theory of choice functions and the theory of closure operators. It is shown that the classes of ordinally rationalizable and path independent choice functions are related to the classes of distributive and anti-exchange closures. 1999 Elsevier Science B.V. All rights reserved.
متن کاملFinite approximations to coherent choice
This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that the effects of approximation can be bounded, although in general, approximation of the credal set may not always be practically possible. In case of pairwise c...
متن کاملCollective Choice Rules on Convex Restricted Domains
We study sets of preferences that are convex with respect to the betweeness relation induced by the Kemeny distance for preferences. It appears that these sets consist of all preferences containing a certain partial ordering and the other way around all preferences containing a given partial ordering form a convex set. Next we consider restricted domains where each agent has a convex set of pre...
متن کاملOn Finding Primitive Roots in Finite Fields
We show that in any finite field Fq a primitive root can be found in time O(q’ ‘+’ ) Let Fq denote a finite field of q elements. An element 0 E IFq is called a primitive root if it generates the multiplicative group F;,“. We show that a combination of known results on distribution primitive roots and the factorization algorithm of [6] leads to a deterministic algorithm to find a primitive root ...
متن کاملFinding roots of polynomials over finite fields
In this letter, we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose–Chaudhuri–Hocquenghem, Reed–Solomon, and some other error-correcting codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(4:6)2015